Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
نویسندگان
چکیده
منابع مشابه
Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the sum of the distances to the elements in the profile. The median (antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (obnoxious) facility in a network. The median function is well studied. For instance ...
متن کاملAxiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the remoteness value, that is, the sum of the distances to the elements in the profile. The median (or antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (or obnoxious) facility in a network. The median fu...
متن کاملAxiomatic Characterization of the antimedian Function on Paths and Hypercubes
An antimedian of a profile π = (x1, x2, . . . , xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the profile. The antimedian function is defined on the set of all profiles on G and has as output the set of antimedians of a profile. It is a typical location function for finding a location for an obnoxious facility. The ‘converse’ of the antimedian f...
متن کاملAxiomatic characterization of the interval function of a block graph
In 1952 Sholander [25] formulated an axiomatic characterization of the interval function of a tree with a partial proof. In 2011 Chvátal et al. [9] gave a completion of this proof. In this paper we present a characterization of the interval function of a block graph using axioms on an arbitrary transit function R. From this we deduce two new characterizations of the interval function of a tree.
متن کاملAxiomatic characterization of the interval function of a graph
A fundamental notion in metric graph theory is that of the interval function I : V × V → 2V − {∅} of a (finite) connected graph G = (V,E), where I(u, v) = { w | d(u, w) + d(w, v) = d(u, v) } is the interval between u and v. An obvious question is whether I can be characterized in a nice way amongst all functions F : V × V → 2V − {∅}. This was done in [13, 14, 16] by axioms in terms of propertie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.04.013